Spiral Trees on Hyper - cubic lattices
نویسنده
چکیده
We study rooted spiral trees in 2, 3 and 4 dimensions on a hyper cubic lattice using exact enumeration and Monte-Carlo techniques. On the square lattice, we also obtain exact lower bound of 1.93565 on the growth constant λ. Series expansions give θ = −1.3667± 0.0010 and ν = 0.6574± 0.0010 on a square lattice. With Monte-Carlo simulations we get the estimates as θ = −1.364±0.010, and ν = 0.656±0.010. These results are numerical evidence against earlier proposed dimensional reduction by four in this problem. In dimensions higher than two, the spiral constraint can be implemented in two ways. In either case, our series expansion results do not support the proposed dimensional reduction. Spiral structures are very common in nature. Some examples of the beautiful spiral structures in galaxies, shoot arrangement in plants, polymers with spiral structure etc may be found in the book by Hargittai [1]. In statistical mechanics, lattice models of spiral self avoiding walks have been studied and can be solved exactly in two dimension [2, 3], though no solution is known for the self avoiding walks without the spiral constraint. A model of spiral trees and animals was proposed by Li and Zhou [4], which based on numerical studies was suggested to be in a new universality class. This problem was further studied by Bose et. al [5]. Based on the numerical evidence, and guided by the fact that magnetic field acting perpendicular to the motion of a charged particle produces spiralling motion and reduction by two in effective dimensionality, they conjectured that
منابع مشابه
Rooted Spiral Trees on Hyper-cubical Lattices
We study rooted spiral trees in 2, 3 and 4 dimensions on a hyper cubical lattice using exact enumeration and Monte-Carlo techniques. On the square lattice, we also obtain exact lower bound of 1.93565 on the growth constant λ. Series expansions give θ = −1.3667 ± 0.001 and ν = 1.3148 ± 0.001 on a square lattice. With Monte-Carlo simulations we get the estimates as θ = −1.364 ± 0.01, and ν = 1.31...
متن کاملLattice Green's functions in all dimensions
We give a systematic treatment of lattice Green’s functions (LGF) on the d-dimensional diamond, simple cubic, body-centred cubic and face-centred cubic lattices for arbitrary dimensionality d 2 for the first three lattices, and for 2 d 5 for the hyper-fcc lattice. We show that there is a close connection between the LGF of the d-dimensional hyper-cubic lattice and that of the (d − 1)-dimensiona...
متن کاملSpanning trees on graphs and lattices in d dimensions
The problem of enumerating spanning trees on graphs and lattices is considered. We obtain bounds on the number of spanning trees NST and establish inequalities relating the numbers of spanning trees of different graphs or lattices. A general formulation is presented for the enumeration of spanning trees on lattices in d 2 dimensions, and is applied to the hypercubic, body-centred cubic, face-ce...
متن کاملEmbedding the graphs of regular tilings and star-honeycombs into the graphs of hypercubes and cubic lattices
We review the regular tilings of d-sphere, Euclidean d-space, hyperbolic d-space and Coxeter’s regular hyperbolic honeycombs (with infinite or star-shaped cells or vertex figures) with respect of possible embedding, isometric up to a scale, of their skeletons into a m-cube or m-dimensional cubic lattice. In section 2 the last remaining 2-dimensional case is decided: for any odd m ≥ 7, star-hone...
متن کاملSite percolation and random walks on d-dimensional Kagomé lattices
The site percolation problem is studied on d-dimensional generalizations of the Kagomé lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q = 2d . The site percolation thresholds are calculated numerically for d = 3, 4, 5, and 6. The scaling of these thresholds as a function of dimension d, or alternatively q, is dif...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005